Quantum Turing Machines: Computations and Measurements
نویسندگان
چکیده
منابع مشابه
Quantum Turing Machines Computations and Measurements
We propose a new formulation of Quantum Turing Machines, as an extension of those proposed by Bernstein and Vazirani. For this new class of Quantum Turing Machines, both finite and infinite computations are meaningful—an infinite computation does not correspond trivially to a divergent function. Moreover, we propose a natural observation protocol for the new QTMs, that does not modify the proba...
متن کاملSome relations between quantum Turing machines and Turing machines
For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components of deterministic Turing machines, the time evolution operator is related with the evolution of reversible Turing machines and the local transition function is related with the transition function of probabilistic and...
متن کاملModels of Quantum Turing Machines
Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator T that is used to construct a Hamiltonian H according to Feynman’s prescription. Differences between these models and the models of Deutsch are discussed and reviewed. It is emphasized that the models with H constructed from T include fully quantum mechanica...
متن کاملQuantum chaos in quantum Turing machines
We investigate a 2-spin quantum Turing architecture, in which discrete local rotations αm of the Turing head spin alternate with quantum controlled NOT-operations. We demonstrate that a single chaotic parameter input αm leads to a chaotic dynamics in the entire Hilbert-space.
متن کاملSimulations of Quantum Turing Machines by Quantum Multi-Stack Machines
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines M , there exists quantum Boolean circuit (n, t)-simulating M , where n denotes the length of input strings, and t is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10165551